Orchestrating Tuple-Based Languages

نویسندگان

  • Rocco De Nicola
  • Andrea Margheri
  • Francesco Tiezzi
چکیده

The World Wide Web can be thought of as a global computing architecture supporting the deployment of distributed networked applications. Currently, such applications can be programmed by resorting mainly to two distinct paradigms: one devised for orchestrating distributed services, and the other designed for coordinating distributed (possibly mobile) agents. In this paper, the issue of designing a programming language aiming at reconciling orchestration and coordination is investigated. Taking as starting point the orchestration calculus Orc and the tuple-based coordination language Klaim, a new formalism is introduced combining concepts and primitives of the original calculi. To demonstrate feasibility and effectiveness of the proposed approach, a prototype implementation of the new formalism is described and it is then used to tackle a case study dealing with a simplified but realistic electronic marketplace, where a number of on-line stores allow client applications to access information about their goods and to place orders.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hybrid Multi-attribute Group Decision Making Method Based on Grey Linguistic 2-tuple

Because of the complexity of decision-making environment, the uncertainty of fuzziness and the uncertainty of grey maybe coexist in the problems of multi-attribute group decision making. In this paper, we study the problems of multi-attribute group decision making with hybrid grey attribute data (the precise values, interval numbers and linguistic fuzzy variables coexist, and each attribute val...

متن کامل

Modelling Temporal Semantics of Data

Recently, many temporal query languages, such as TCAL and TQuel have been proposed for temporal databases. However, there are still some limitations such as the inadequacy on operating data with temporal elements and handling the semantics of time ‘NOW ’ in these temporal query languages. After defining a new temporal relational algebra, in this paper we build a tuple calculus language based on...

متن کامل

Mobile Co-ordination: Providing Fault Tolerance in Tuple Space Based Co-ordination Languages

In this paper we describe the concept of mobile coordination , a general purpose approach to overcoming failure of agents when using distributed tuple spaces. We demonstrate why mobile coordination is better than using existing techniques such as transactions, how mobile coordination can provide extra functionality in the form of agent wills, and how the framework to provide this can be impleme...

متن کامل

Optimizing Analysis for First-Class Tuple-Spaces

This paper considers the design and optimization of a simple asynchronous parallel language that uses rst-class tuple-spaces as its main communication and process creation device. Our proposed kernel language diiers from other tuple-space languages insofar tuple-spaces are treated as true rst-class objects. Moreover, we develop a formal framework for constructing an optimizing pre-processor for...

متن کامل

A Run-Time System for WCL

WCL is an inter-agent co-ordination language designed for Internet and Web based agent systems. WCL is based on shared associative memories called tuple spaces, as introduced in Linda. In this paper we describe a novel run-time system for WCL. This distributed run-time system is radically di erent from traditional run-time systems supporting tuple spaces because it performs on-they analysis of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011